B22 - Dungeon 1
提出
code: python
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
dp = 10 ** 9 * (n+1)
dp1 = 0
for i in range(n-2):
dpi+2 = max(dpi+2, ai)
dpi+3 = max(dpi+2, bi)
解答
code: python
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
dp = 2000000000 * n
dp0 = 0
for i in range(n):
if i <= n-2:
dpi+1 = min(dpi+1, dpi+ai)
if i <= n-3:
dpi+2 = min(dpi+2, dpi+bi)
print(dpn-1)